Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
نویسندگان
چکیده
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedure into a general-purpose refutation-based theorem prover. We suggest that this is a large and interesting class of procedures and show how to integrate these procedures to accelerate a general-purpose theorem prover doing deductive synthesis. While much existing research on decision procedures has been either in isolation or in the context of interfacing procedures to non-refutation-based theorem provers, this appears to be the first reported work on decision procedures in the context of refutationbased deductive synthesis where witnesses must be found.
منابع مشابه
Using Decision Procedures to Build Domain-Specific Deductive Synthesis Systems
This paper describes a class of decision procedures that we have found useful for efficient, domainspecific deductive synthesis. These procedures are called closure-based ground literal satisfiability procedures. We argue that this is a large and interesting class of procedures and show how to interface these procedures to a theorem prover for efficient deductive synthesis. Finally, we describe...
متن کاملExperience Report on Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving o er the promise of \correct by construction" software. However, the diÆculty encountered in constructing usable deductive synthesis systems has pr evente d their widespr ead use. A mphion is a realworld, domain-independent programsynthesis system. It is specialized to speci c applications through the creation of an operatio...
متن کاملKnowledge representation with SOA
This paper addresses the problem of supporting the software development process through the artificial intelligence. The expert systems could advise the Domain Engineer in programming without the detailed experience in programming languages. He will use and integrate, with the help of deductive database and domain knowledge, the previously developed software components to new complex functional...
متن کاملAutomating Software Reuse
ment, whose objective is to empower domain experts themselves to specialize AM-PHION to an application domain. It is meant to be the automatic programming analogue of application generator generator technology. META-AMPHION will include an extension of the current user interface to guide domain experts in creating and extending a domain theory (in fact, the current user interface is already sui...
متن کاملWhatever Happened to Deductive Question Answering?
Deductive question answering, the extraction of answers to questions from machine-discovered proofs, is the poor cousin of program synthesis. It involves much of the same technology—theorem proving and answer extraction—but the bar is lower. Instead of constructing a general program to meet a given specification for any input—the program synthesis problem—we need only construct answers for spec...
متن کامل